Relaxed Cone Stepping for Relief Mapping
نویسندگان
چکیده
The presence of geometric details on object surfaces dramatically changes the way light interacts with these surfaces. Although synthesizing realistic pictures requires simulating this interaction as faithfully as possible, explicitly modeling all the small details tends to be impractical. To address these issues, an image-based technique called relief mapping has recently been introduced for adding per-fragment details onto arbitrary polygonal models (Policarpo et al. 2005). The technique has been further extended to render correct silhouettes (Oliveira and Policarpo 2005) and to handle non-height-field surface details (Policarpo and Oliveira 2006). In all its variations, the ray-height-field intersection is performed using a binary search, which refines the result produced by some linear search procedure. While the binary search converges very fast, the linear search (required to avoid missing large structures) is prone to aliasing, by possibly missing some thin structures, as is evident in Figure 18-1a. Several space-leaping techniques have since been proposed to accelerate the ray-height-field intersection and to minimize the occurrence of aliasing (Donnelly 2005, Dummer 2006, Baboud and Décoret 2006). Cone step mapping (CSM) (Dummer 2006) provides a clever solution to accelerate the intersection calculation for the average case and avoids skipping height-field structures by using some precomputed data (a cone map). However, because CSM uses a conservative approach, the rays tend to stop before the actual surface, which introduces different Relaxed Cone Stepping for Relief Mapping
منابع مشابه
Graph Convergence for H(.,.)-co-Accretive Mapping with over-Relaxed Proximal Point Method for Solving a Generalized Variational Inclusion Problem
In this paper, we use the concept of graph convergence of H(.,.)-co-accretive mapping introduced by [R. Ahmad, M. Akram, M. Dilshad, Graph convergence for the H(.,.)-co-accretive mapping with an application, Bull. Malays. Math. Sci. Soc., doi: 10.1007/s40840-014-0103-z, 2014$] and define an over-relaxed proximal point method to obtain the solution of a generalized variational inclusion problem ...
متن کاملComments on relaxed $(gamma, r)$-cocoercive mappings
We show that the variational inequality $VI(C,A)$ has aunique solution for a relaxed $(gamma , r)$-cocoercive,$mu$-Lipschitzian mapping $A: Cto H$ with $r>gamma mu^2$, where$C$ is a nonempty closed convex subset of a Hilbert space $H$. Fromthis result, it can be derived that, for example, the recentalgorithms given in the references of this paper, despite theirbecoming more complicated, are not...
متن کاملDisplacement Mapping on the GPU - State of the Art
This paper reviews the latest developments of displacement mapping algorithms implemented on the vertex, geometry, and fragment shaders of graphics cards. Displacement mapping algorithms are classified as per-vertex and per-pixel methods. Per-pixel approaches are further categorized as safe algorithms that aim at correct solutions in all cases, to unsafe techniques that may fail in extreme case...
متن کاملOccasionally Weakly Compatible Mapping in Cone Metric Space
In this paper, we obtain some fixed point theorems for occasionally weakly compatible mappings in cone metric space. Our results extends the result of A.Bhatt, et al.[A. Bhatt, et al., Common fixed point theorems for occasionally weakly compatible mappings under relaxed conditions, Nonlinear Anal., 73(2010) 176-182]. Mathematics Subject Classification: Primary: 47H10, 54H25
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007